Geodesic PCA in the Wasserstein space by convex PCA
نویسندگان
چکیده
منابع مشابه
Non-convex Robust PCA
We propose a new method for robust PCA – the task of recovering a low-rank matrix from sparse corruptions that are of unknown value and support. Our method involves alternating between projecting appropriate residuals onto the set of low-rank matrices, and the set of sparse matrices; each projection is non-convex but easy to compute. In spite of this non-convexity, we establish exact recovery o...
متن کاملPCA in Autocorrelation Space
The use of higher order autocorrelations as features for pattern classification has been usually restricted to second or third orders due to high computational costs. Since the autocorrelation space is a high dimensional space we are interested in reducing the dimensionality of feature vectors for the benefit of the pattern classification task. An established technique is Principal Component An...
متن کاملProvable Non-convex Robust PCA
We propose a new method for robust PCA – the task of recovering a low-rank matrix from sparse corruptions that are of unknown value and support. Our method involves alternating between projecting appropriate residuals onto the set of lowrank matrices, and the set of sparse matrices; each projection is non-convex but easy to compute. In spite of this non-convexity, we establish exact recovery of...
متن کاملEvaluating Dye Concentration in Bicomponent Solution by PCA-MPR and PCA-ANN Techniques
This paper studies the application of principal component analysis, multiple polynomial regression, and artificial neural network ANN techniques to the quantitative analysis of binary mixture of dye solution. The binary mixtures of three textile dyes including blue, red and yellow colors were analyzed by PCA-Multiple polynomial Regression and PCA-Artificial Neural network PCA-ANN methods. The o...
متن کاملFast and Simple PCA via Convex Optimization
The problem of principle component analysis (PCA) is traditionally solved by spectral or algebraic methods. We show how computing the leading principal component could be reduced to solving a small number of well-conditioned convex optimization problems. This gives rise to a new efficient method for PCA based on recent advances in stochastic methods for convex optimization. In particular we sho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales de l'Institut Henri Poincaré, Probabilités et Statistiques
سال: 2017
ISSN: 0246-0203
DOI: 10.1214/15-aihp706